Model-theoretic inseparability and modularity of description logic ontologies
نویسندگان
چکیده
منابع مشابه
Model-theoretic inseparability and modularity of description logic ontologies
The aim of this paper is to introduce and study model-theoretic notionsof modularity in description logic and related reasoning problems. Our ap-proach is based on a generalisation of logical equivalence that is called model-theoretic inseparability. Two TBoxes are inseparable w.r.t. a vocabulary Σif they cannot be distinguished by the Σ-reducts of their models and thuscan e...
متن کاملInseparability and Conservative Extensions of Description Logic Ontologies: A Survey
The question whether an ontology can safely be replaced by another, possibly simpler, one is fundamental for many ontology engineering and maintenance tasks. It underpins, for example, ontology versioning, ontology modularization, forgetting, and knowledge exchange. What ‘safe replacement’ means depends on the intended application of the ontology. If, for example, it is used to query data, then...
متن کاملQuery Inseparability for Description Logic Knowledge Bases
We investigate conjunctive query inseparability of description logic (DL) knowledge bases (KBs) with respect to a given signature, a fundamental problem for KB versioning, module extraction, forgetting and knowledge exchange. We study the data and combined complexity of deciding KB query inseparability for fragments of Horn-ALCHI, including the DLs underpinning OWL 2 QL and OWL 2 EL. While all ...
متن کاملDecomposing Description Logic Ontologies
Recent years have seen the advent of large and complex ontologies, most notably in the medical domain. As a consequence, structuring mechanisms for ontologies are nowadays viewed as an indispensible tool. A basic such mechanism is the automatic decomposition of the vocabulary of an ontology into independent parts. In this paper, we study decompositions that are syntax independent in the sense t...
متن کاملSimplifying Description Logic Ontologies
We discuss the problem of minimizing TBoxes expressed in the lightweight description logic EL, which forms a basis of some large ontologies like SNOMED, Gene Ontology, NCI and Galen. We show that the minimization of TBoxes is intractable (NP-complete). While this looks like a bad news result, we also provide a heuristic technique for minimizing TBoxes. We prove the correctness of the heuristics...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2013
ISSN: 0004-3702
DOI: 10.1016/j.artint.2013.07.004